The weak pigeonhole principle for function classes inS12
نویسندگان
چکیده
منابع مشابه
The weak pigeonhole principle for function classes in S^1_2
It is well known that S1 2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S1 2 for provably weaker function classes. §
متن کاملResolution and the Weak Pigeonhole Principle
We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower bounds for tree-like resolution proofs. We present a normal form for resolution proofs of pigeonhole principles based on a new monotone resolution rule.
متن کاملImproved Resolution Lower Bounds for the Weak Pigeonhole Principle
Recently, Raz Raz01] established exponential lower bounds on the size of resolution proofs of the weak pigeonhole principle. We give another proof of this result which leads to better numerical bounds.
متن کاملResolution lower bounds for the weak functional pigeonhole principle
We show that every resolution proof of the functional version FPHPm n of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp ( Ω ( n (logm)2 )) . This implies an exp ( Ω(n1/3) ) bound when the number of pigeons m is arbitrary.
متن کاملLower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conjunctions. We prove that the weak pigeonhole principle and random unsatisfiable CNF formulas require exponential-size proofs in this system. This is the strongest system beyond Resolution for which such lower bounds are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MLQ
سال: 2006
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.200610015